A Low-Complexity LoRa Synchronization Algorithm Robust to Sampling Time Offsets

نویسندگان

چکیده

LoRaWAN is nowadays one of the most popular protocols for low-power Internet Things communications. Although its physical layer, namely LoRa, has been thoroughly studied in literature, aspects related to synchronization LoRa receivers have received little attention so far. The estimation and correction carrier frequency sampling time offsets (STOs) are, however, crucial attain low sensitivity levels offered by spread-spectrum modulation. goal this article build a low-complexity, yet efficient algorithm capable correcting both offsets. To end, complete analytical model signal corrupted these first derived. Using model, we propose new estimator STO. We also show that estimations STOs cannot be performed independently. Therefore, avoid complex joint offsets, an iterative low-complexity proposed. reach packet error rate 10 ?3 , performance evaluations proposed receiver requires only 1 or 2 dB higher signal-to-noise ratio than theoretical perfectly synchronized receiver, while incurring very computational overhead.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computer Network Time Synchronization using a Low Cost GPS Engine

Accurate and reliable time is necessary for financial and legal transactions, transportation, distribution systems, and many other applications. Time synchronization protocols such as NTP (the Network Time Protocol) have kept clocks of such applications synchronized to each other for many years. Nowadays there are many commercial GPS based NTP time server products at the market but they almost ...

متن کامل

Time and Space Complexity Reduction of a Cryptanalysis Algorithm

Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...

متن کامل

Time and Space Complexity Reduction of a Cryptanalysis Algorithm

Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...

متن کامل

Low complexity estimation of carrier and sampling frequency offsets in burst-mode OFDM systems

Residual carrier frequency offset (CFO) and sampling frequency offset (SFO) in orthogonal frequency-division multiplexing (OFDM) transmission result in loss of orthogonality between the subcarriers, which severely degrades system performance. This makes effective CFO and SFO estimation methods essential for such systems. In this work, we address the joint estimation of CFO and SFO, focusing on ...

متن کامل

Low Complexity Time Synchronization Algorithm for OFDM Systems with Repetitive Preambles

In this paper, a new time synchronization algorithm for OFDM systems with repetitive preamble is proposed. This algorithm makes use of coarse and fine time estimation; the fine time estimation is performed using a cross-correlation similar to previous proposals in the literature, whereas the coarse time estimation is made using a new metric and an iterative search of the last sample of the repe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Internet of Things Journal

سال: 2022

ISSN: ['2372-2541', '2327-4662']

DOI: https://doi.org/10.1109/jiot.2021.3101002